Generalized Canadian traveller problems
نویسندگان
چکیده
This study investigates a generalization of the Canadian Traveller Problem (CTP), which finds real applications in dynamic navigation systems used to avoid traffic congestion. Given a road network G = (V, E) in which there is a source s and a destination t in V , every edge e in E is associated with two possible distances: original d(e) and jam d+(e). A traveller only finds out which one of the two distances of an edge upon reaching an end vertex incident to the edge. The objective is to derive an adaptive strategy for travelling from s to t so that the competitive ratio, which compares the distance traversed with that of the static s, t-shortest path in hindsight, is minimized. This problem was initiated by Papadimitriou and Yannakakis. They proved that it is PSPACE-complete to obtain an algorithm with a bounded competitive ratio. In this paper, we propose tight lower bounds of the problem when the number of ”traffic jams” is a given constant k; and we introduce a deterministic algorithm with a min{r, 2k+1}-ratio, which meets the proposed lower bound, where r is the worst-case performance ratio. We also consider the Recoverable CTP, where each blocked edge is associated with a recovery time to reopen. Finally, we discuss the uniform jam cost model, i.e., for every edge e, d+(e) = d(e)+ c, for a constant c.
منابع مشابه
Path Finding under Uncertainty through Probabilistic Inference
We introduce a new approach to solving path-finding problems under uncertainty by representing them as probabilistic models and applying domain-independent inference algorithms to the models. This approach separates problem representation from the inference algorithm and provides a framework for efficient learning of path-finding policies. We evaluate the new approach on the Canadian Traveller ...
متن کاملA Risk-Reward Competitive Analysis for the Recoverable Canadian Traveller Problem
From the online point of view, we study the Recoverable Canadian Traveller Problem (Recoverable-CTP) in a special network, in which the traveller knows in advance the structure of the network and the travel time of each edge. However, some edges may be blocked and the traveller only observes that upon reaching the vertex of the blocked edge, and the blocked edge may be reopened but the travelle...
متن کاملExact Algorithms for the Canadian Traveller Problem on Paths and Trees
The Canadian Traveller problem is a stochastic shortest paths problem in which one learns the cost of an edge only when arriving at one of its endpoints. The goal is to find an adaptive policy (adjusting as one learns more edge lengths) that minimizes the expected cost of travel. The problem is known to be #P hard. Since there has been no significant progress on approximation algorithms for sev...
متن کاملRoute Planning under Uncertainty: The Canadian Traveller Problem
The Canadian Traveller problem is a stochastic shortest paths problem in which one learns the cost of an edge only when arriving at one of its endpoints. The goal is to find an optimal policy that minimizes the expected cost of travel. The problem is known to be #P-hard. Since there has been no significant progress on approximation algorithms for several decades, we have chosen to seek out spec...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Comb. Optim.
دوره 29 شماره
صفحات -
تاریخ انتشار 2015